package com.algorithm.class20;

/**
 * 344. 反转字符串
 *
 * <p>编写一个函数，其作用是将输入的字符串反转过来。输入字符串以字符数组 char[] 的形式给出。
 *
 * <p>不要给另外的数组分配额外的空间，你必须原地修改输入数组、使用 O(1) 的额外空间解决这一问题。
 *
 * <p>你可以假设数组中的所有字符都是 ASCII 码表中的可打印字符。
 *
 * <p>
 *
 * <p>示例 1：
 *
 * <p>输入：["h","e","l","l","o"] 输出：["o","l","l","e","h"] 示例 2：
 *
 * <p>输入：["H","a","n","n","a","h"] 输出：["h","a","n","n","a","H"]
 *
 * <p>来源：力扣（LeetCode） 链接：https://leetcode-cn.com/problems/reverse-string
 * 著作权归领扣网络所有。商业转载请联系官方授权，非商业转载请注明出处。
 *
 * @author frank woo(吴峻申) <br>
 *     email:<a href="mailto:frank_wjs@hotmail.com">frank_wjs@hotmail.com</a> <br>
 * @date 2020/8/16 18:07<br>
 */
public class ReverseString {
  /**
   * https://leetcode-cn.com/problems/reverse-string/solution/zi-yong-fan-zhuan-zi-fu-chuan-by-agasar/
   *
   * @param s
   */
  public void reverseString(char[] s) {
    int n = s.length;
    char tmp;
    for (int i = 0; i < n / 2; i++) {
      tmp = s[i];
      s[i] = s[n - 1 - i];
      s[n - 1 - i] = tmp;
    }
  }
}
